The pickup and delivery traveling salesman problem with handling costs
نویسندگان
چکیده
This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and reload other loads that block access. Since the additional handling operations take time and effort, penalty costs are associated with them. The aim of the PDTSPH is to find a feasible route such that the total costs, consisting of travel costs and penalty costs, are minimized. We show that the PDTSPH is a generalization of the pickup and delivery traveling salesman problem (PDTSP) and the pickup and delivery traveling salesman problem with LIFO loading (PDTSPL). We propose a large neighborhood search (LNS) heuristic to solve the problem. We compare our LNS heuristic against best known solutions on 163 benchmark instances for the PDTSP and 42 benchmark instances for the PDTSPL. We provide new best known solutions on 52 instances for the PDTSP and on 14 instances for the PDTSPL, besides finding the optimal or best known solution on 100 instances for the PDTSP and on 21 instances for the PDTSPL. The LNS finds optimal or near-optimal solutions on instances for the PDTSPH. Results show that PDTSPH solutions provide large reductions in handling compared to PDTSP solutions, while increasing the travel distance by only a small percentage.
منابع مشابه
Empirical Analysis of Improvement Algorithms for the Pickup and Delivery Traveling Salesman Problem
This paper presents an empirical analysis of some implementations of tour improvement heuristics designed for the pickup and delivery traveling salesman problem. Results show that while the classical 2-opt traveling salesman algorithm can be implemented very efficiently, available implementations of the 3-opt are much less efficient. Among tested algorithms, the only one to produce significant ...
متن کاملThe fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: Formulation and a heuristic algorithm
In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...
متن کاملAn Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading Francesco Carrabs and Raffaele Cerulli Dipartimento di Matematica ed Informatica, Università di Salerno, 84084 Fisciano (SA), Italy [email protected], [email protected] Jean-François Cordeau Canada Research Chair in Logistics and Transportation and CIRRELT HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Ca...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady State Genetic Algorithm (GA) is proposed for the Traveling Salesman Problem with Pickup and Delivery (TSPPD). TSPPD is an extension of the well known Traveling Salesman Problem (TSP). TSPPD is a graph and grouping optimization problem.In this thesis, TSPPD is differentiated by a group of cities as customers, each of them supplying (picking customer) or demanding (delivery customer) a g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 257 شماره
صفحات -
تاریخ انتشار 2017